Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode
نویسندگان
چکیده
منابع مشابه
Fast Evaluation of Multiquadric RBF Sums by a Cartesian Treecode
A treecode is presented for evaluating sums defined in terms of the multiquadric radial basis function (RBF), φ(x) = (|x|2 + c2)1/2, where x ∈ R3 and c ≥ 0. Given a set of N nodes, evaluating an RBF sum directly requires CPU time that scales like O(N2). For a given level of accuracy, the treecode reduces the CPU time to O(N logN) using a far-field expansion of φ(x). We consider two options for ...
متن کاملA Fast Treecode for Multiquadric Interpolation with Varying Shape Parameters
A treecode algorithm is presented for the fast evaluation of multiquadric radial basis function (RBF) approximations. The method is a dual approach to one presented by Krasny and Wang, which applies far-field expansions to clusters of RBF centers (source points). The new approach clusters evaluation points instead and is therefore easily able to cope with basis functions that have different mul...
متن کاملA Cartesian treecode for screened coulomb interactions
A treecode algorithm is presented for evaluating electrostatic potentials in a charged particle system undergoing screened Coulomb interactions in 3D. The method uses a farfield Taylor expansion in Cartesian coordinates to compute particle–cluster interactions. The Taylor coefficients are evaluated using new recurrence relations which permit efficient computation of high order approximations. T...
متن کاملOptimal variable shape parameter for multiquadric based RBF-FD method
In this follow up paper to our previous study in [2], we present a new technique to compute the solution of PDEs with the multiquadric based RBF finite difference method (RBF-FD) using an optimal node dependent variable value of the shape parameter. This optimal value is chosen so that, to leading order, the local approximation error of the RBF-FD formulas is zero. In our previous paper [2] we ...
متن کاملFast evaluation of multiple zeta sums
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = ∑ n1>n2>...>nd 1 n1 1 n s2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finite sum of products of rapidly convergent series. Perhaps surprisingly, one may develop fast summation algorithms of such efficiency that the overall complexity can be brought down essentially to that of one-dimensional summation. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2011
ISSN: 1064-8275,1095-7197
DOI: 10.1137/090779851